基于正则表达式的测试数据自动生成技术

软件测试是提高软件可靠性、保证软件质量的重要手段。数据自动生成是测试自动化的重要组成部分。提出一种基于正则表达式的测试数据自动生成技术,生成的数据应该具有随机性、可控制、可定义、有意义、无错误等特性,特别是对大字段／专有类型等特殊类型的支持,可以解决目前测试数据自动生成存在的问题,具有良好的扩展性。     

随机正则(k,r)-SAT问题的可满足临界

研究k-SAT问题实例中每个变元恰好出现r=2s次,且每个变元对应的正、负文字都出现s次的严格随机正则（k,r）-SAT问题.通过构造一个特殊的独立随机实验,结合一阶矩方法,给出了严格随机正则（k,r）-SAT问题可满足临界值的上界.由于严格正则情形与正则情形的可满足临界值近似相等,因此得到了随机正则（k,r）-SAT问题可满足临界值的新上界.该上界不仅小于当前已有的随机正则（k,r）-SAT问题的可满足临界值上界,而且还小于一般的随机k-SAT问题的可满足临界值.因此,这也从理论上解释了在相变点处的随机正则（k,r）-SAT问题实例通常比在相应相变点处同规模的随机k-SAT问题实例更难满足的原因.最后,数值分析结果验证了所给上界的正确性.     

Development of broadband forward‐wave directional couplers loaded by periodic patterned ground structure

In this paper two wideband Forward‐Wave Directional Couplers (FWDCs) with 0 dB and 3 dB coupling level are proposed. Using periodic patterned ground structure in a microstrip coupled lines by a new unit cell; even‐ and odd‐mode characteristic impedances of the couplers are equal over a wide frequency range. Moreover, it provides a constant phase difference between even and odd‐modes. The proposed cell is modeled using the equivalent circuit model and a design procedure is introduced for designing FWDCs for an arbitrary value of coupling level. The introduced couplers are numerically investigated and a prototype of both couplers is made. It is shown that for 0 dB coupling level, the measured coupling is 0.85 dB with 1 dB flatness over fractional bandwidth of 96% bandwidth. In case of 3 dB coupling, the measured coupling level is 3.5 dB at 7.42 GHz with 1 dB flatness over fractional bandwidth of 67.1%.     

基于外部排序的字串左右熵快速计算方法

左右熵在自然语言处理领域有着广泛应用,但目前尚无有效方法实施大规模语料中海量模式的左右熵快速计算。提出了一种计算方法,对于某长度字串计算熵,首先按长度提取语料中的全部字串,使用外部排序和归并获取字串的出现频率,然后分别剔除首尾字符构造待计算字串的频率提供文件,最后使用文件记录频率对比来计算右熵和左熵。分析和实验表明,该方法的计算量同语料规模成线性关系,适于大规模语料中海量字串的左右熵计算。     

一种新的基于统计的词典扩展方法

在建立统计语言模型时,往往会遇到词典的词汇量不够的问题。对于医学等专业领域的语料,这一问题尤为严重。针对这一问题,本文提出了一种新的基于统计的识别新词方法——右边缘扩展法。该方法对分词后的语料中产生的连续单字词进行关联范数估计,利用右边缘扩展的方法判断词的边界。在实验中,我们将右边缘扩展法与基于Witten-Bell back off方法的两两合并法相结合,循环地调整词典,优化语言模型。实验结果表明,该算法具有很高的识别正确率与检出率,可以有效地识别出语料中出现的新词汇,尤其是专业术语。     

大幅面地图的快速自动地形晕渲

在提出一个建立三维规则数据场的新算法的基础上,提出了一个可用于大幅度地图的快速实用的地形自动晕渲算法,与传统数据网格化的方法不同,本算法采用了用网格点相邻等高线的高程值插值计算出网格点高程值的新思想,并且提出了相应的网格点相邻等高线的识别方法,该方法充分利用等高线所具有的先验知识,得到的网格点高程值质量很高,另外,该规则数据场的建立方法经改进后,其时间复杂性与数据点数（ｍ）和网格点数（ｎ）成线性关     

Efficient video encryption scheme based on advanced video coding

A video encryption scheme combining with advanced video coding (AVC) is presented and analyzed in this paper, which is different from the ones used in MPEG1/2 video encryption. In the proposed scheme, the intra-prediction mode and motion vector difference are encrypted with the length-kept encryption algorithm (LKE) in order to keep the format compliance, and the residue data of the macroblocks are encrypted with the residue data encryption algorithm (RDE) in order to keep low cost. Additionally, a key distribution scheme is proposed to keep the robustness to transmission errors, which assigns sub-keys to different frames or slices independently. The encryption scheme’s security, time efficiency and error robustness are analyzed in detail. Experimental results show that the encryption scheme keeps file format unchanged, is secure against replacement attacks, is efficient in computing, and is robust to some transmission errors. These properties make it a suitable choice for real-time applications, such as secure IPTV, secure videoconference or mobile/wireless multimedia, etc.

Bounds on the bisection width for random d -regular graphs

In this paper we provide an explicit way to compute asymptotically almost sure upper bounds on the bisection width of random d$d$-regular graphs, for any value of d$d$. The upper bounds are obtained from the analysis of the performance of a randomized greedy algorithm to find bisections of d$d$-regular graphs. We provide bounds for 5≤d≤12$5\le d\le 12$. We also give empirical values of the size of the bisection found by the algorithm for some small values of d$d$ and compare them with numerical approximations of our theoretical bounds. Our analysis also gives asymptotic lower bounds for the size of the maximum bisection.     

A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems

This paper is a review of the approachesdeveloped to solve 2D packing problems withmeta-heuristic algorithms. As packing tasks arecombinatorial problems with very large searchspaces, the recent literature encourages theuse of meta-heuristic search methods, inparticular genetic algorithms. The objective ofthis paper is to present and categorise thesolution approaches in the literature for 2Dregular and irregular strip packing problems.The focus is hereby on the analysis of themethods involving genetic algorithms. Anoverview of the methods applying othermeta-heuristic algorithms including simulatedannealing, tabu search, and artificial neuralnetworks is also given.     

Approximate fixed point sequence for a finite family of asymptotically pseudocontractive mappings

Let E be a real Banach space and K be a nonempty, closed, convex, and bounded subset of E. Let T_i:K→K, i=1,2,…,N, be N uniformly L-Lipschitzian, uniformly asymptotically regular with sequences {ε_n}, and asymptotically pseudocontractive mappings with sequences , where {ε_n} and , i=1,2,…,N, satisfy certain mild conditions. Let a sequence {x_n} be generated from x₁K by

for all integers n1, where T_n=T_n(modN), {u_n} be a sequence in K, and {λ_n}, {θ_n} and {μ_n} are three real sequences in [0,1] satisfying appropriate conditions; then x_n−T_lx_n→0 as n→∞ for each l{1,2,…,N}.